Comparison of heuristic approaches for the multiple depot vehicle scheduling problem

Given a set of timetabled tasks, the multi-depot vehicle scheduling problemis a well-known problem that consists of determining least-cost schedulesfor vehicles assigned to several depots such that each task is accomplishedexactly once by a vehicle. In this paper, we propose to compare theperformance of five different heuristic approaches for this problem,namely, a heuristic \\mip solver, a Lagrangian heuristic, a columngeneration heuristic, a large neighborhood search heuristic using columngeneration for neighborhood evaluation, and a tabu search heuristic. Thefirst three methods are adaptations of existing methods, while the last twoare novel approaches for this problem. Computational results on randomlygenerated instances show that the column generation heuristic performs thebest when enough computational time is available and stability is required,while the large neighborhood search method is the best alternative whenlooking for a compromise between computational time and solution quality.tabu search;column generation;vehicle scheduling;heuristics;Lagrangian heuristic;large neighborhood search;multiple depot

Comparison of heuristic approaches for the multiple depot vehicle scheduling problem

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a well-known problem that consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished exactly once by a vehicle. In this paper, we propose to compare the performance of five different heuristic approaches for this problem, namely, a heuristic \\mip solver, a Lagrangian heuristic, a column generation heuristic, a large neighborhood search heuristic using column generation for neighborhood evaluation, and a tabu search heuristic. The first three methods are adaptations of existing methods, while the last two are novel approaches for this problem. Computational results on randomly generated instances show that the column generation heuristic performs the best when enough computational time is available and stability is required, while the large neighborhood search method is the best alternative when looking for a compromise between computational time and solution quality

Use of SMS texts for facilitating access to online alcohol interventions: a feasibility study

A41 Use of SMS texts for facilitating access to online alcohol interventions: a feasibility study In: Addiction Science & Clinical Practice 2017, 12(Suppl 1): A4

Highly restricted near-surface permafrost extent during the mid-Pliocene warm period

Accurate understanding of permafrost dynamics is critical for evaluating and mitigating impacts that may arise as permafrost degrades in the future; however, existing projections have large uncertainties. Studies of how permafrost responded historically during Earth's past warm periods are helpful in exploring potential future permafrost behavior and to evaluate the uncertainty of future permafrost change projections. Here, we combine a surface frost index model with outputs from the second phase of the Pliocene Model Intercomparison Project to simulate the near-surface (~3 to 4 m depth) permafrost state in the Northern Hemisphere during the mid-Pliocene warm period (mPWP, ~3.264 to 3.025 Ma). This period shares similarities with the projected future climate. Constrained by proxy-based surface air temperature records, our simulations demonstrate that near-surface permafrost was highly spatially restricted during the mPWP and was 93 ± 3% smaller than the preindustrial extent. Near-surface permafrost was present only in the eastern Siberian uplands, Canadian high Arctic Archipelago, and northernmost Greenland. The simulations are similar to near-surface permafrost changes projected for the end of this century under the SSP5-8.5 scenario and provide a perspective on the potential permafrost behavior that may be expected in a warmer world